A low-complexity variable forgetting factor constant modulus RLS algorithm for blind adaptive beamforming
نویسندگان
چکیده
In this paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operates in the generalized sidelobe canceler (GSC) structure. A detailed study of its operating properties is carried out, including a convexity analysis and a mean squared error (MSE) analysis of its steady-state behavior. The results of numerical experiments demonstrate that the proposed VFF mechanism achieves a superior learning and tracking performance compared to other VFF mechanisms. & 2014 Elsevier B.V. All rights reserved.
منابع مشابه
Low-Complexity Variable Forgetting Factor Constrained Constant Modulus RLS Algorithm for Adaptive Beamforming
In this paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operates in the generalized sidelobe canceler (GSC) structure. A detailed study of its operating propert...
متن کاملLow Complexity and High speed in Leading DCD ERLS Algorithm
Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...
متن کاملBlind Adaptive Beamforming Based on Constrained Constant Modulus RLS Algorithm for Smart Antennas
In this paper, we study the performance of blind adaptive beamforming algorithms for smart antennas in realistic environments. A constrained constant modulus (CCM) design criterion is described and used for deriving a recursive least squares (RLS) type optimization algorithm. Furthermore, two kinds of scenarios are considered in the paper for analyzing its performance. Simulations are performed...
متن کاملLow-Complexity Constrained Constant Modulus SG-based Beamforming Algorithms with Variable Step Size
In this paper, two low-complexity adaptive step size algorithms are investigated for blind adaptive beamforming. Both of them are used in a stochastic gradient (SG) algorithm, which employs the constrained constant modulus (CCM) criterion as the design approach. A brief analysis is given for illustrating their properties. Simulations are performed to compare the performances of the novel algori...
متن کاملENTER TITLE HERE (14 pt type size, 10 words max, uppercase, bold, centered)
An approximation for the constant modulus (CM) cost function is proposed to allow the use of the fast recursive least squares (RLS) algorithm. Simulations are performed to compare the performance of the introduced RLS-CM and stochastic gradient descent (SGD) algorithms for blind adaptive beamforming. Results indicate that the introduced RLS-CM has faster convergence speed and good tracking abil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal Processing
دوره 105 شماره
صفحات -
تاریخ انتشار 2014